Random Sampling, Halfspace Range Reporting, and Construction of ( K)-levels in Three Dimensions
نویسنده
چکیده
Given n points in three dimensions, we show how to answer halfspace range reporting queries in O(log n + k) expected time for an output size k. Our data structure can be preprocessed in optimal O(n log n) expected time. We apply this result to obtain the rst optimal randomized algorithm for the construction of the (k)-level in an arrangement of n planes in three dimensions. The algorithm runs in O(n log n+nk 2) expected time. Our techniques are based on random sampling. Applications in two dimensions include an improved data structure for \k nearest neighbors" queries, and an algorithm that constructs the order-k Voronoi diagram in O(n log n + nk log k) expected time.
منابع مشابه
Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions
Given n points in three dimensions, we show how to answer halfspace range reporting queries in O(log n+k) expected time for an output size k. Our data structure can be preprocessed in optimal O(n log n) expected time. We apply this result to obtain the rst optimal randomized algorithm for the construction of the (k)-level in an arrangement of n planes in three dimensions. The algorithm runs in ...
متن کاملOptimal halfspace range reporting in three dimensions
We give the first optimal solution to a standard problem in computational geometry: three-dimensional halfspace range reporting. We show that n points in 3-d can be stored in a linear-space data structure so that all k points inside a query halfspace can be reported in O(log n + k) time. The data structure can be built in O(n logn) expected time. The previous methods with optimal query time req...
متن کاملOptimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
We present optimal deterministic algorithms for constructing shallow cuttings in an arrangement of lines in two dimensions or planes in three dimensions. Our results improve the deterministic polynomial-time algorithm of Matoušek (1992) and the optimal but randomized algorithm of Ramos (1999). This leads to efficient derandomization of previous algorithms for numerous wellstudied problems in co...
متن کاملOutput-Sensitive Tools for Range Searching in Higher Dimensions
Let P be a set of n points in R. A point p ∈ P is k-shallow if it lies in a halfspace which contains at most k points of P (including p). We show that if all points of P are k-shallow, then P can be partitioned into Θ(n/k) subsets, so that any hyperplane crosses at most O((n/k) log(n/k)) subsets. Given such a partition, we can apply the standard construction of a spanning tree with small crossi...
متن کاملNew Applications of random Sampling in Computational Geometry
This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry. One new algorithm creates a search structure for arrangements of hyperplanes by sampling the hyperplanes and using information from the resulting arrangement to divide and conquer. This algorithm requires O(s) expected preprocessing time to build a search structure for an arran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998